منابع مشابه
Disjunctions, Independence, Reenements
An important question in constraint satisfaction is how to restrict the problem to ensure tractability (since the general problem is NP-hard). The use of disjunctions has proven to be a useful method for constructing tractable constraint classes from existing classes; the well-known`max-closed' and`ORD-Horn' constraints are examples of tractable classes that can be constructed this way. Three s...
متن کاملScopal Independence: A Note on Branching and Wide Scope Readings of Indefinites and Disjunctions
Hintikka claimed in the 1970s that indefinites and disjunctions give rise to 'branching readings' that can only be handled by a 'game-theoretic' semantics as expressive as a logic with (a limited form of) quantification over Skolem functions. Due to empirical and methodological difficulties, the issue was left unresolved in the linguistic literature. Independently, however, it was discovered in...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملLearning Disjunctions of Features
Littlestone's Winnow algorithm for learning disjunctions of Boolean attributes where most attributes are irrelevant is one of the most fundamental results in learning theory. Because of the importance of Winnow, it is natural to try extending Winnow to learn disjunctions of features (i.e., concepts). In doing so, we may generalize some earlier applications of Winnow. In this paper, we extend Wi...
متن کاملDisambiguating with Controlled Disjunctions
In this paper, we propose a disambiguating technique called controlled disjunctions. This extension of the so-called named disjunctions relies on the relations existing between feature values (covariation, control, etc.). We show that controlled disjunctions can implement different kind of ambiguities in a consistent and homogeneous way. We describe the integration of controlled disjunctions in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2002
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(02)00224-2